Multi-Item Nontruthful Auctions Achieve Good Revenue

نویسندگان

چکیده

We present a general framework for designing approximately revenue-optimal mechanisms multi-item additive auctions, which applies to both truthful and nontruthful auctions. Given (not necessarily truthful) single-item auction format satisfying certain technical conditions, we run simultaneous item auctions augmented with personalized entry fee each bidder that must be paid before the can accessed. These fees depend only on prior distribution of types in particular are independent realized bids. bound revenue resulting two-part tariff mechanism using novel geometric technique enables guarantees many common previously had none. Our approach adapts extends duality Cai, Devanur, Weinberg [SIAM J. Comput., 50 (2021), pp. STOC16-160–STOC16-200] beyond used formats, such as first-price, second-price, all-pay results first-price first multidimensional environments, addressing an open question literature [T. Roughgarden, V. Syrgkanis, E. Tardos, Artificial Intelligence Res., 59 (2017), 59–101]. If used, prove is also credible sense auctioneer cannot benefit by deviating from stated after observing agent This static achieves constant factor optimal revenue. second-price obtain -approximate fixed amenable tuning via online learning techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stepwise randomized combinatorial auctions achieve revenue monotonicity

In combinatorial auctions that use VCG, a seller can sometimes increase revenue by dropping bidders (see e.g. [5]). In our previous work [26], we showed that such failures of “revenue monotonicity” occur under an extremely broad range of deterministic strategyproof combinatorial auction mechanisms, even when bidders have “known single-minded” valuations. In this work we consider the question of...

متن کامل

Multi-item Vickrey-Dutch auctions

Descending price auctions are adopted for goods that must be sold quickly and in private values environments, for instance in flower, fish, and tobacco auctions. In this paper, we introduce ex post efficient descending auctions for two environments: multiple non-identical items and buyers with unit-demand valuations; and multiple identical items and buyers with non-increasing marginal values. O...

متن کامل

Item Pricing for Revenue Maximization in Combinatorial Auctions

In this talk we present item pricing algorithms and mechanisms for revenue maximization in combinatorial auctions. We start by considering the unlimitedsupply combinatorial auction setting and present a simple algorithm [1] which achieves an O(k) approximation for the case of single-minded bidders who each want at most k items, improving on the O(k2) bound of Briest and Krysta [3]. We then show...

متن کامل

Simple and Nearly Optimal Multi-Item Auctions

We provide a Polynomial Time Approximation Scheme (PTAS) for the Bayesian optimal multiitem multi-bidder auction problem under two conditions. First, bidders are independent, have additive valuations and are from the same population. Second, every bidder’s value distributions of items are independent but not necessarily identical monotone hazard rate (MHR) distributions. For non-i.i.d. bidders,...

متن کامل

Multi-item Vickrey-English-Dutch auctions

Assuming that bidders wish to acquire at most one item, this paper defines a polynomial time multiitem auction that locates the VCG prices in a finite number of iterations for any given starting prices. This auction is called the Vickrey-English-Dutch auction and it contains the Vickrey-English auction (J.K. Sankaran, Math. Soc. Sci. 28:143–150, 1994) and the Vickrey-Dutch auction (D. Mishra an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 2022

ISSN: ['1095-7111', '0097-5397']

DOI: https://doi.org/10.1137/22m1471742